Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Shortest Path Multicast Routing under Delay and Delay Variation Constraints
A new heuristic algorithm is proposed for constructing multicast tree for multimedia and interactive applications that require certain quality of services, QoS. We consider two main QoS parameters that are the delay and delay variation. The problem is formulated as constructing shortest path tree under delay and delay variation constraints. The tree is used to concurrently transmit packets from...
متن کاملAn Efficient Algorithm for Delay Delay-variation Bounded Least Cost Multicast Routing
Many multimedia communication applications require a source to transmit messages to multiple destinations subject to quality of service (QoS) delay constraint. To support delay constrained multicast communications, computer networks need to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. This is known as multicast delay problem. On the other hand...
متن کاملAn Efficient Algorithm for Delay and Delay-Variation Bounded Core Based Tree Generation
Many multimedia group applications require the construction of multicast tree satisfying the quality of service (QoS) requirements. To support real time communication, computer networks need to optimize the Delay and Delay-Variation Bounded Multicast Tree (DVBMT). The problem is to satisfy the end-to-end delay and delay-variation within an upper bound. The DVBMT problem is known to be NP comple...
متن کاملAn Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and tens of heuristics have been developed to solve this NP-complete problem. Among all the previously proposed algorithms, the bounded shortest path algorithm (BSMA) [15] have proved to be capable of producing a multicast t...
متن کاملAdvanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost
The Bounded Shortest Multicast Algorithm (BSMA) is a very well-known one of delay-constrained minimum-cost multicast routing algorithms. Although the algorithm shows excellent performance in terms of generated tree cost, it suffers from high time complexity. For this reason, there is much literature relating to the BSMA. In this paper, the BSMA is analyzed. The algorithms and shortcomings are c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartC
سال: 2005
ISSN: 1598-2858
DOI: 10.3745/kipstc.2005.12c.1.105